Asymptotic computational complexity - PDFSEARCH.IO - Document Search Engine

Asymptotic computational complexity
Results: 28

#	Item
11	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
12	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
13	CS161 Design and Analysis of Algorithms Dan Boneh 1 Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2001-04-08 18:20:48 Mathematical notation Computational complexity theory Asymptotic analysis Combinatorics Big O notation Heap Factorial Randomized algorithm Summation Mathematics Theoretical computer science Analysis of algorithms
14	T D C C  M M Department of Computer Science, University of Cyprus 75 Kallipoleos St., CY-1678 Add to Reading List Source URL: www.cs.ucy.ac.cy Language: English - Date: 2008-07-29 05:34:16 Analysis of algorithms Consensus Time complexity Algorithm Shortest path problem Distributed computing Asymptotically optimal algorithm Asymptotic computational complexity Theoretical computer science Applied mathematics Computational complexity theory
15	Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli1 , Markus Wagner2 , and Frank Neumann2 1 Add to Reading List Source URL: www.tunnuz.net Language: English - Date: 2014-09-12 00:58:22 Applied mathematics Mathematics Operations research Asymptotic analysis Mathematical optimization Big O notation Theoretical computer science Computational complexity theory Analysis of algorithms
16	Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:03:45 NP-complete problems Hamiltonian path Shortest path problem NP-complete Asymptotic analysis Graph coloring Graph Computational complexity theory Random graph Graph theory Theoretical computer science Mathematics
17	LOGARITHMIC LOWER BOUNDS IN THE CELL-PROBE MODEL∗ ˇ MIHAI PATRAS ¸ CU† AND ERIK D. DEMAINE† Abstract. We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enab Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2008-09-07 01:08:29 Big O notation Mathematical notation LG Corp Computational complexity theory Ordinal number Analysis of algorithms Mathematics Asymptotic analysis
18	Location, Location, Location—The Role of Spatial Locality in Asymptotic Energy Minimization Add to Reading List Source URL: ic.ese.upenn.edu Language: English - Date: 2012-12-07 21:21:13 Computational complexity theory Mathematics Asymptotically optimal algorithm Field-programmable gate array Parallel computing Time complexity Big O notation Circuit complexity Reconfigurable computing Analysis of algorithms Applied mathematics Computer science
19	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Srini Devadas and Erik Demaine March 7, 2008 Handout 6 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2008-03-11 14:32:14 Mathematics Information retrieval Analysis of algorithms Computational complexity theory Asymptotic analysis Hash table Hash function Heap Universal hashing Search algorithms Hashing Theoretical computer science
20	May 21, [removed]Spring 2008 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2008-12-08 16:50:45 Analysis of algorithms Binary trees Asymptotic analysis B-tree Big O notation Time complexity Shortest path problem AVL tree Heap Theoretical computer science Mathematics Computational complexity theory